Triangulation of 3D Surfaces Recovered from STL Grids
نویسندگان
چکیده
منابع مشابه
Direct Triangulation of 3D Surfaces Using the Advancing Front Technique
A robust and eecient algorithm for discretization of tensor product polynomial surfaces is presented. The advancing front technique operating directly on the surface in the physical space is employed. This avoids diiculties with the anisotropic trian-gulation of parametric space of these surfaces and also guarantees the creation of well shaped triangles even in case of degenerated or badly para...
متن کاملTriangulation-free 3D Reconstruction from LiDAR Data
We demonstrate a generic method for visualization of high-resolution unorganized and noisy 3D data points with a surface of significantly lower resolution. To this effect, we feed our algorithm with all the go Light Detection And Ranging (LiDAR) data and approximate it with a triangular mesh that is being deformed iteratively until convergence. Our main contribution is avoiding the direct trian...
متن کاملOptimal Triangulation of Saddle Surfaces
We consider the piecewise linear approximation of saddle functions of the form f(x, y) = ax − by under the L∞ error norm. We show that interpolating approximations are not optimal. One can get slightly smaller errors by allowing the vertices of the approximation to move away from the graph of the function.
متن کاملExtraction of Intersection curves from Iso-surfaces on co-located 3D grids
This paper presents new methods for efficient extraction of intersection curves between iso-surfaces of any pair of co-located 3D scalar fields. The first method is based on the Marching Cubes algorithm which has been enhanced to produce an additional data structure that makes it possible to reduce the complexity of the general surface intersection extraction from O(N) to O( √ N), where N denot...
متن کاملParallel 3D Delaunay Triangulation
The paper deals with the parallelization of Delaunay triangulation algorithms, giving more emphasis to pratical issues and implementation than to theoretical complexity. Two parallel implementations are presented. The first one is built on DeWall, an E triangulator based on an original interpretation of the divide & conquer paradigm. The second is based on an incremental construction algorithm....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Polytechnica
سال: 2004
ISSN: 1805-2363,1210-2709
DOI: 10.14311/620